منابع مشابه
On the b-Chromatic Number of Graphs
Computing the chromatic number of a graph is an NP-hard problem. For random graphs and some other classes of graphs, estimators of the expected chromatic number have been well studied. In this paper, a new 0–1 integer programming formulation for the graph coloring problem is presented. The proposed new formulation is used to develop a method that generates graphs of known chromatic number by us...
متن کاملOn approximating the b-chromatic number
We consider the problem of approximating the b-chromatic number of a graph. We show that there is no constant ε > 0 for which this problem can be approximated within a factor of 120/113− ε in polynomial time, unless P = NP. This is the first hardness result for approximating the b-chromatic number.
متن کاملthe investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
B-chromatic Number of Cacti
A b-colouring of a graph G is a proper colouring of G such that each colour contains a vertex that is adjacent to all other colours and the b-chromatic number χb(G) is the maximum number of colours used in a b-colouring of G. If m(G) is the largest integer k such that G has at least k vertices with degree at least k − 1, then we know that χb(G) ≤ m(G). Irving and Manlove [1] prove that, if T is...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL OF COMPUTER APPLICATION
سال: 2017
ISSN: 2250-1797
DOI: 10.26808/rs.ca.i7v6.04